Two Strongly Truthful Mechanisms for Three Heterogeneous Agents Answering One Question

نویسندگان

چکیده

Peer prediction mechanisms incentivize self-interested agents to truthfully report their signals even in the absence of verification by comparing agents’ reports with peers. We propose two new mechanisms, Source and Target Differential Prediction, prove very strong guarantees for a general setting. Our Prediction are strongly truthful : Truth-telling is strict Bayesian Nash equilibrium. Also, truth-telling pays strictly higher than any other equilibria, excluding permutation which same amount as truth-telling. The hold asymmetric priors among agents, need not know ( detail-free ) single question setting . Moreover, they only require three , each submits item (answers), her forecast (prediction one agent’s reports). proof technique straightforward, conceptually motivated, turns on logarithmic scoring rule’s special properties. we can recast Truth Serum mechanism [ 20 ] into our framework. also extend results continuous slightly weaker guarantee optimality

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Truthful Mechanisms for One-Parameter Agents

In this paper, we show how to design truthful (dominant strategy) mechanisms for several combinatorial problems where each agent’s secret data is naturally expressed by a single positive real number. The goal of the mechanisms we consider is to allocate loads placed on the agents, and an agent’s secret data is the cost she incurs per unit load. We give an exact characterization for the algorith...

متن کامل

Improvements for Truthful Mechanisms with Verifiable One-Parameter Selfish Agents

In this paper we study optimization problems with verifiable one-parameter selfish agents introduced by Auletta et al. [ICALP 2004]. Our goal is to allocate load among the agents, provided that the secret data of each agent is a single positive rational number: the cost they incur per unit load. In such a setting the payment is given after the load completion, therefore if a positive load is as...

متن کامل

Strongly Polynomial-Time Truthful Mechanisms in One Shot

One of the main challenges in algorithmic mechanism design is to turn (existing) efficient algorithmic solutions into efficient truthful mechanisms. Building a truthful mechanism is indeed a difficult process since the underlying algorithm must obey certain “monotonicity” properties and suitable payment functions need to be computed (this task usually represents the bottleneck in the overall ti...

متن کامل

Improvements for Truthful Mechanisms with Verifiable One-Parameter Agents

In this paper we study optimization problems with verifiable one-parameter selfish agents introduced by Auletta et al. [ICALP 2004]. Our goal is to allocate load among the agents, provided that the secret data of each agent is a single positive rational number: the cost they incur per unit load. In such a setting the payment is given after the load completion, therefore if a positive load is as...

متن کامل

One Search Engine or Two for Question-Answering

We present here a preliminary analysis of the results of our runs in the Question Answering track of TREC9. We have developed a complete system, including our own indexer and search engine, GuruQA, which provides document result lists that our Answer Selection module processes to identify answer fragments. Some TREC participants use a standard set of result lists provided by AT&T’s running of t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: ACM transactions on economics and computation

سال: 2022

ISSN: ['2167-8383', '2167-8375']

DOI: https://doi.org/10.1145/3565560